BOTBIN: Accelerated Indexing for Structural Graph Clustering on Dynamic Graphs

Abstract

Graph clustering is a fundamental data mining task that clusters vertices into different groups. The structural graph clustering algorithm (SCAN) is a widely used graph clustering algorithm that derives not only clustering results, but also special roles of vertices like hubs and outliers. In this paper, we consider structural graph clustering on dynamic graphs under Jaccard similarity. The state-of-the-art index-based solution focuses on static graphs and incurs prohibitive update costs to maintain indices. Lately, an efficient approximate dynamic structural graph clustering algorithm DynStrClu under Jaccard similarity is proposed. However, their solution needs to fix input parameters while..